Convergence of a Fourier - Spline Representation for the Full - turn Map Generator
نویسندگان
چکیده
Single-turn data from a symplectic tracking code can be used to construct a canonical generator for a full-turn symplectic map. This construction has been carried out numerically in canonical polar coordinates, the generator being obtained as a Fourier series in angle coordinates with coe cients that are spline functions of action coordinates. Here we provide a mathematical basis for the procedure, nding su cient conditions for the existence of the generator and convergence of the Fourier-spline expansion. The analysis gives insight concerning analytic properties of the generator, showing that in general there are branch points as a function of angle and inverse square root singularities at the origin as a function of action. To be published in Proceedings of the Conference on Particle Beam Stability and Nonlinear Dynamics, Institute for Theoretical Physics, Santa Barbara, California, December 3-5, 1996, AIP Conference Proceedings Work supported in part by Department of Energy contract DE{AC03{76SF00515.
منابع مشابه
Full-turn Symplectic Map from a Generator in a Fourier-spline Basis*
Given an arbitrary symplectic tracking code, one can construct a full-turn symplectic map that approximates the result of the code to high accuracy. The map is de fined implicitly by a mixed-variable generating function. The generator is represented by a Fourier series in angle variables, with coefficients given as B-spline functions of action variables. It is constructed by using results of si...
متن کاملSpline Expansion of a Map Generator in Cartesian Coordinates
Data from orbits of a symplectic integrator can be interpolated so as to construct an approximation to the generating function of a Poincar e map. The time required to compute an orbit of the symplectic map induced by the generator can be much less than the time to follow the same orbit by symplectic integration. The construction has been carried out previously for full-turn maps of large parti...
متن کاملSPLINE COLLOCATION METHOD FOR SOLVING BOUNDARY VALUE PROBLEMS
The spline collocation method is used to approximate solutions of boundary value problems. The convergence analysis is given and the method is shown to have second-order convergence. A numerical illustration is given to show the pertinent features of the technique.
متن کاملNON-POLYNOMIAL SPLINE FOR THE NUMERICAL SOLUTION OF PROBLEMS IN CALCULUS OF VARIATIONS
A Class of new methods based on a septic non-polynomial spline function for the numerical solution of problems in calculus of variations is presented. The local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. The inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. Convergence anal...
متن کاملSolving a nonlinear inverse system of Burgers equations
By applying finite difference formula to time discretization and the cubic B-splines for spatial variable, a numerical method for solving the inverse system of Burgers equations is presented. Also, the convergence analysis and stability for this problem are investigated and the order of convergence is obtained. By using two test problems, the accuracy of presented method is verified. Additional...
متن کامل